CTStudy of Wireless Epidemic Spread in Dynamic Human Connectivity Traces Eiko Yoneki1 and Jon Crowcroft1 1 University of Cambridge, Computer Laboratory, Cambridge, CB3 0FD, United Kingdom

Source URL: www.ifr.ac.uk

Models of effective connectivity &
 Dynamic Causal Modelling (DCM) Presented by: Ariana Anderson Slides shared by: Karl Friston

Source URL: www.brainmapping.org

Correspondence of the brain’s functional architecture during activation and rest Stephen M. Smitha,1, Peter T. Foxb, Karla L. Millera, David C. Glahnb,c, P. Mickle Foxb, Clare E. Mackaya, Nicola Filippinia, Kate E. Wat

Source URL: www.brainmap.org

• Cognitive neuroscience
• Neuroimaging
• Magnetic resonance imaging
• Neuroscience
• Medical imaging
• Resting state fMRI
• Functional magnetic resonance imaging
• Functional neuroimaging
• Electroencephalography
• Default mode network
• Brain
• Dynamic functional connectivity

Parsimonious Flooding in Dynamic Graphs∗ Hervé Baumann Pierluigi Crescenzi Pierre Fraigniaud

Source URL: www.liafa.jussieu.fr

• Mathematics
• Reachability
• Chernoff bound
• Random walk
• Random graph
• Statistics
• Graph connectivity
• Graph theory

Chapter 15 Dynamic Networks Many large-scale distributed systems and networks are dynamic. In some networks, e.g., peer-to-peer, nodes participate only for a short period of time, and the topology can change at a high r

Source URL: dcg.ethz.ch

• Connectivity
• Flow network
• Topology
• Distributed data storage
• Tango tree
• Push-relabel maximum flow algorithm
• Graph theory
• Mathematics
• Network flow

Connectivity Games over Dynamic Networks Sten Grünera,1 , Frank G. Radmacherb,2,∗, Wolfgang Thomasb a RWTH Aachen University, Lehrstuhl für Prozessleittechnik, 52054 Aachen, Germany Aachen University, Lehrstuhl für

Source URL: www.automata.rwth-aachen.de

• Graph connectivity
• Reachability
• Connectivity

172 Chapter 15 Dynamic Networks Many large-scale distributed systems and networks are dynamic. In some networks, e.g., peer-to-peer, nodes participate only for a short period of time, and

Source URL: dcg.ethz.ch

• Network flow
• Graph connectivity
• Bridge
• Flow network
• Connectivity
• Topology
• Push-relabel maximum flow algorithm
• Tango tree
• Graph theory
• Mathematics
• Combinatorics

Proceedings of IEEE conference on “Computer Vision and Pattern Recognition” (CVPR), 1998 p.648 Markov Random Fields with Efficient Approximations Yuri Boykov

Source URL: www.cs.iastate.edu

• Connectivity
• Dynamic programming
• Maximum flow problem
• Cut
• Mathematics
• Graph theory
• Applied mathematics

Parameterized Algorithms for Graph Partitioning Problems Hadas Shachnai and Meirav Zehavi Department of Computer Science, Technion, Haifa 32000, Israel {hadas,meizeh}@cs.technion.ac.il Abstract. We study a broad class of

Source URL: www.cs.technion.ac.il

• NP-complete problems
• Combinatorial optimization
• Dynamic programming
• Mathematical optimization
• Operations research
• Optimal control
• Connectivity
• Tree decomposition
• Parameterized complexity
• Theoretical computer science
• Graph theory
• Mathematics

Static and Dynamic Properties of Small-world Connection Topologies Based on Transit-stub Networks

Source URL: www.complex-systems.com

• Network theory
• Electronic engineering
• Topology
• Biconnected component
• Graph
• Connected component
• Connectivity
• Regular graph
• Tree
• Graph theory
• Graph connectivity
• Networks